using both binary and residue representations for achieving fast converters in rns
Authors
abstract
in this paper, a new method is introduced for improving the efficiency of the residue number system, which uses both binary and residue representations in order to represent a number. a residue number system uses the remainder of the division in several different modules. conversion of a number to smaller ones and carrying out parallel calculations on these numbers greatly increase the speed of the arithmetic operations. but as a result of using the non-weighted system, the performance of some calculations such as comparison and reverse conversion is extraordinarily difficult as compared with binary representation. we can use the benefits of both representations in the novel system and this scheme has a simple implementation for reverse/forward conversion.
similar resources
Using both Binary and Residue Representations for Achieving Fast Converters in RNS
In this paper, a new method is introduced for improving the efficiency of the Residue Number System, which uses both binary and residue representations in order to represent a number. A residue number system uses the remainder of the division in several different modules. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers greatly increase the speed of...
full textUsing both Binary and Residue Representations for Achieving Fast Converters in RNS
In this paper, a new method is introduced for improving the efficiency of the Residue Number System, which uses both binary and residue representations in order to represent a number. A residue number system uses the remainder of the division in several different modules. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers greatly increase the speed of...
full textAutomated Implementation of Rns-to-binary Converters
In this paper we will present an implementation of an RNS-to-Binary Converter based on the mixed radix conversion algorithm by using recently proposed new cell-elements. The proposed architecture can be generated automatically for arbitrary sets of moduli and the method is straight forward. This method is very well suited for standard cell implementations resulting in compact layouts.
full textNew Arithmetic Residue to Binary Converters
The residue number system (RNS) is a carry-free number system which can support high-speed and parallel arithmetic. Two major issues in efficient design of RNS systems are the moduli set selection and the residue to binary conversion. In this paper, we present two efficient residue to binary converters for the new three-moduli set {2, 2 + 1, 2 – 1}. This moduli set consists of pairwise relative...
full textMemoryless RNS-to-binary converters for the {2n+1 - 1, 2n, 2n - 1} moduli set
In this paper, we propose two novel memoryless reverse converters for the moduli set {2 − 1, 2, 2 − 1}. The first proposed converter does not entirely cover the dynamic range while the second proposed converter covers the entire dynamic range. First, we simplify the Chinese Remainder Theorem in order to obtain a reverse converter that utilizes mod-(2 − 1) operation. Second, we further reduce th...
full textNew distributed algorithms for fast sign detection in residue number systems (RNS)
We identify a canonical parameter in the Chinese Remainder Theorem (CRT) and call it the ‘‘Reconstruction Coefficient’’, (denoted by ‘‘RC ’’); and introduce the notions of ‘‘Partial’’ and ‘‘Full’’ Reconstruction. If the RC can be determined efficiently, then arithmetic operations that are (relatively) harder to realize in RNS; including Sign Detection, Base change/extension and Scaling or divis...
full textMy Resources
Save resource for easier access later
Journal title:
journal of advances in computer researchجلد ۲، شماره ۳، صفحات ۹۱-۱۰۴
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023